Stable group scheduling
نویسندگان
چکیده
We consider the situation in which an organizer is trying to convene an event, and needs to decide on a schedule: a time slot and a set of invitees from a given set of agents. For each possible time slot, each agent has a single-peaked preference over the number of attendees at the event. Agent also has the outside option of not attending, which she prefers in some situations. The task of the organizer is to issue a maximum stable schedule – the invited agents prefer attending to not attending, the agents not invited do not regret not being invited, and the event has the maximum number of attendees subject to these stability requirements. We consider both the non-strategic and strategic cases. In the former, in which agents truthfully reveal their preferences, we provide a polynomial-time algorithm for determining whether a stable schedule exists, and if it does, determining the maximum such schedule. In the strategic case we provide a truthful mechanism for the case in which the preferences of the agents are monotonically increasing, and an impossibility result for the general case.
منابع مشابه
A New Approach Generating Robust and Stable Schedules in m-Machine Flow Shop Scheduling Problems: A Case Study
This paper considers a scheduling problem with uncertain processing times and machine breakdowns in industriall/office workplaces and solves it via a novel robust optimization method. In the traditional robust optimization, the solution robustness is maintained only for a specific set of scenarios, which may worsen the situation for new scenarios. Thus, a two-stage predictive algorithm is prop...
متن کاملStable and Practical Scheduling Algorithms for High Speed Virtual Output Queuing Switches
High-performance input queued switches achieve good performance with low cost. However, with the appearance of optical techniques, the line rate is much higher than before. Scheduling algorithms require not only good performance in delay and stability but fast speed and simple implementation as well. A variety of scheduling algorithms for Virtual Output Queuing (VOQ) packet switch architecture ...
متن کاملRobust Fixed-order Gain-scheduling Autopilot Design using State-space Stability-Preserving Interpolation
In this paper, a robust autopilot is proposed using stable interpolation based on Youla parameterization. The most important condition of stable interpolation between local controllers is the preservation of stability so that each local controller can ensure stability for an open neighborhood around a nominal point. The proposed design used fixed-order robust controller with parameter-dependent...
متن کاملStable Round-Robin Scheduling Algorithms for High-Performance Input Queued Switches
High-performance input-queued switches require highspeed scheduling algorithms while maintaining good performance. Various round-robin scheduling algorithms for Virtual Output Queuing (VOQ) crossbar-based packet switch architectures have been proposed. It has been demonstrated that they can operate at high speed (e.g., OC192), and are relatively simple to implement in hardware. In particular, a...
متن کاملStability of Lu-Kumar Networks under Longest-Queue and Longest-Dominating-Queue Scheduling
We consider the stability of robust scheduling policies for Lu-Kumar networks. These are open networks with arbitrary routing matrix and several disjoint groups of queues in which at most one queue can be served at a time in each group. The arrival and potential service processes and routing decisions at the queues are independent, stationary and ergodic. A scheduling policy is called robust if...
متن کاملA heuristic approach for multi-stage sequence-dependent group scheduling problems
We present several heuristic algorithms based on tabu search for solving the multi-stage sequence-dependent group scheduling (SDGS) problem by considering minimization of makespan as the criterion. As the problem is recognized to be strongly NP-hard, several meta (tabu) search-based solution algorithms are developed to efficiently solve industry-size problem instances. Also, two different initi...
متن کامل